A Class of Transformational Recognition Grammars
نویسنده
چکیده
1. PETmCK considers transformational grammars (T-grammars) of a special* form which essentially have the properties described by N. CHOMSKY (1965). a) The base grammar is context-free. One recursive element S is distinguished. The base trees in general have the form s s or in linear notation Consequently each base tree consists of a finite set of subtrees or kernel trees each of the form S(@ $1(...)@) where x is a string Over i I shall assume the reader somewhat familiar with the theory of generative trans-formational grammar. :-:
منابع مشابه
Computational Complexity and Lexical Funtional Grammar
An important goal of modern linguistic theory is to characterize as narrowly as possible the class of natural languages. One classical approach to this characterization has been to investigate the generative capacity of grammatical systems specifiable within particular linguistic theories. Formal results along these lines have already been obtained for certain kinds of Transformational Generat ...
متن کاملObling: a Tester for Transformational Grammars
Transformational grammars have developed with recent research in linguistics. They appear to be a powerful and explicit device for characterizing the description of sentences; they also meet conditions of adequacy that can be applied to check that a sentence, or a set of rules, is well-formed. A transformational grammar tester is part of a strategy for the selection of a well-formed grammar mat...
متن کاملMinimalist grammars and recognition
Abstract Recent work has shown how basic ideas of the minimalist tradition in transformational syntax can be captured in a simple generative formalism, a “derivational minimalism.” This framework can model “remnant movement” analyses, which yield more complex antecedent-trace relations, suggesting a new and significant sense in which linguistic structures are “chain based.” Michaelis (1998) sho...
متن کاملOn the Generative Power of
Mathematical modeling of phrase structure grammars has yielded many results of benefit to linguists in their investigation of these grammars, such as Chomsky’s characterization in terms of self-embedding of those context-free languages which are not regular. The recent shift of focus in linguistic theory to transformational grammars has not been accompanied by a similar application of mathemati...
متن کاملOn Restrictions on Transformational Grammars Reducing the Generative Power
Various restrictions on transformational grammars have been investigated in order to reduce their generative power from recursively enumerable languages to recursive languages. It will be shown that any restriction on transformational grammars defining a recursively enumerable subset of the set of all transformational grammars, is either too weak (in the sense that there does not exist a genera...
متن کامل